The Higher Order Hausdorff Voronoi Diagram and Vlsi Critical Area Extraction for Via-blocks

نویسنده

  • EVANTHIA PAPADOPOULOU
چکیده

We extend the Voronoi diagram framework to compute the critical area of a circuit layout [15, 12, 16, 13, 14] with the ability to accurately compute critical area for via-blocks on via and contact layers in the presence of multilayer loops, redundant vias, and redundant interconnects. Critical area is a measure reflecting the sensitivity of a VLSI design to random defects during IC manufacturing. The method is based on concepts of the higher order Hausdorff Voronoi diagram of point clusters in the plane. We investigate structural properties of the order-k Hausdorff Voronoi diagram and present a simple iterative approach that computes the ordinary Hausdorff Voronoi diagram of iteratively determined clusters of points. We highlight simplifications in the L∞ metric, a metric of practical interest in VLSI critical area extraction.

منابع مشابه

The L∞ Hausdorff Voronoi Diagram Revisited

We revisit the L∞ Hausdorff Voronoi diagram of clusters of points, equivalently, the L∞ Hausdorff Voronoi diagram of rectangles, and present a plane sweep algorithm for its construction that generalizes and improves upon previous results. We show that the structural complexity of the L∞ Hausdorff Voronoi diagram is Θ(n+m), where n is the number of given clusters and m is the number of essential...

متن کامل

Net-aware Critical Area extraction for VLSI opens via Voronoi diagrams

We address the problem of computing critical area for opens in a circuit layout in the presence of loops and redundant interconnects. The extraction of critical area is the main computational problem in VLSI yield prediction for random manufacturing defects. Our approach first models the problem as a graph problem and solves it efficiently by exploiting its geometric nature. The approach expand...

متن کامل

The hausdorff voronoi diagram of polygonal objects: a divide and conquer approach

We study the Hausdorff Voronoi diagram of a set S of polygonal objects in the plane, a generalization of Voronoi diagrams based on the maximum distance of a point from a polygon, and show that it is equivalent to the Voronoi diagram of S under the Hausdorff distance function. We investigate the structural and combinatorial properties of the Hausdorff Voronoi diagram and give a divide and conque...

متن کامل

Higher Order Voronoi Diagrams of Segments for VLSI Critical Area Extraction

We address the problem of computing critical area for open faults in a circuit layout in the presence of multilayer loops and redundant interconnects. The extraction of critical area is a fundamental problem in VLSI yield prediction. We first model the problem as a graph problem and then we solve it efficiently by exploiting its geometric nature. We introduce the open-fault Voronoi diagram of p...

متن کامل

Randomized incremental construction of the Hausdorff Voronoi diagram of non-crossing clusters

The Hausdorff Voronoi diagram of a set of clusters of points in the plane is a generalization of the classic Voronoi diagram, where distance between a point t and a cluster P is measured as the maximum distance, or equivalently the Hausdorff distance between t and P . The size of the diagram for non-crossing clusters is O(n ), where n is the total number of points in all clusters. In this paper...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

متن کامل
عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008